A School Bus Routing Heuristic Algorithm Allowing Heterogeneous Fleets and Bus Stop Selection

Abstract This paper addresses a school bus routing problem formulated as capacitated and time-constrained open vehicle with heterogeneous fleet single loads. incorporates several realistic features, such student eligibility, maximum walking distances, stop selection, riding times, different types of buses, multistops, dwell times. A heuristic algorithm based on an iterated local search approach is proposed for this problem. It determines the selection stops from set potential stops, assignment students to selected routes along stops. The main objectives are minimizing number buses used, total distance, route journey time. Other aims balancing times between empty seats. 20 real-world instances used evaluate performance algorithm. Results indicate that finds high-quality solutions in very short amounts computational